Parallel Dichotomy Algorithm for solving tridiagonal system of linear equations with multiple right-hand sides
نویسندگان
چکیده
منابع مشابه
the block lsmr algorithm for solving linear systems with multiple right-hand sides
lsmr (least squares minimal residual) is an iterative method for the solution of the linear system of equations and leastsquares problems. this paper presents a block version of the lsmr algorithm for solving linear systems with multiple right-hand sides. the new algorithm is based on the block bidiagonalization and derived by minimizing the frobenius norm of the resid ual matrix of normal equa...
متن کاملParallel dichotomy algorithm for solving tridiagonal SLAEs
A parallel algorithm for solving a series of matrix equations with a constant tridiagonal matrix and different right-hand sides is proposed and studied. The process of solving the problem is represented in two steps. The first preliminary step is fixing some rows of the inverse matrix of SLAEs. The second step consists in calculating solutions for all right-hand sides. For reducing the communic...
متن کاملIDR(s) for linear equations with multiple right-hand sides
for x, where A is a given n × n matrix, and b a given n-vector. We have many opportunities to solve linear equations with the same coefficient matrix and different right-hand sides (RHSs). Therefore, block Krylov subspace methods such as the block Bi-CG (Bl-BCG), block Bi-CGSTAB (Bl-BiCGSTAB) [2], block GMRES (Bl-GMRES) and block QMR (Bl-QMR) methods have been developed for solving block linear...
متن کاملthe block lsmr method: a novel efficient algorithm for solving non-symmetric linear systems with multiple right-hand sides
it is well known that if the coefficient matrix in a linear system is large and sparse or sometimes not readily available, then iterative solvers may become the only choice. the block solvers are an attractive class of iterative solvers for solving linear systems with multiple right-hand sides. in general, the block solvers are more suitable for dense systems with preconditioner. in this paper,...
متن کاملRestarting the Nonsymmetric Lanczos Algorithm for Eigenvalues and Linear Equations Including Multiple Right-Hand Sides
A restarted nonsymmetric Lanczos algorithm is given for computing eigenvalues and both right and left eigenvectors. The restarting limits the storage so that finding eigenvectors is practical. Restarting also makes it possible to deal with roundoff error in new ways. We give a scheme for avoiding near-breakdown and discuss maintaining biorthogonality. A system of linear equations can be solved ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2010
ISSN: 0167-8191
DOI: 10.1016/j.parco.2010.02.005